Subset Space Logic with Arbitrary Announcements
Identifieur interne : 001480 ( Main/Exploration ); précédent : 001479; suivant : 001481Subset Space Logic with Arbitrary Announcements
Auteurs : Philippe Balbiani [France] ; Hans Van Ditmarsch [France, Inde] ; Andrey Kudinov [Russie]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: In this paper we introduce public announcements to Subset Space Logic (SSL). In order to do this we have to change the original semantics for SSL a little and consider a weaker version of SSL without the cross axiom. We present an axiomatization, prove completeness and show that this logic is PSPACE-complete. Finally, we add the arbitrary announcement modality which expresses “true after any announcement”, prove several semantic results, and show completeness for a Hilbert-style axiomatization of this logic.
Url:
DOI: 10.1007/978-3-642-36039-8_21
Affiliations:
- France, Inde, Russie
- District fédéral central, Grand Est, Lorraine (région)
- Metz, Moscou, Nancy
- Université de Lorraine
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000F95
- to stream Istex, to step Curation: 000F80
- to stream Istex, to step Checkpoint: 000106
- to stream Main, to step Merge: 001492
- to stream Main, to step Curation: 001480
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Subset Space Logic with Arbitrary Announcements</title><author><name sortKey="Balbiani, Philippe" sort="Balbiani, Philippe" uniqKey="Balbiani P" first="Philippe" last="Balbiani">Philippe Balbiani</name></author><author><name sortKey="Van Ditmarsch, Hans" sort="Van Ditmarsch, Hans" uniqKey="Van Ditmarsch H" first="Hans" last="Van Ditmarsch">Hans Van Ditmarsch</name></author><author><name sortKey="Kudinov, Andrey" sort="Kudinov, Andrey" uniqKey="Kudinov A" first="Andrey" last="Kudinov">Andrey Kudinov</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:43CB7EDD46EE62E35797219287474695DF82BE3E</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-36039-8_21</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-6628GH60-R/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000F95</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000F95</idno><idno type="wicri:Area/Istex/Curation">000F80</idno><idno type="wicri:Area/Istex/Checkpoint">000106</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000106</idno><idno type="wicri:doubleKey">0302-9743:2013:Balbiani P:subset:space:logic</idno><idno type="wicri:Area/Main/Merge">001492</idno><idno type="wicri:Area/Main/Curation">001480</idno><idno type="wicri:Area/Main/Exploration">001480</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Subset Space Logic with Arbitrary Announcements</title><author><name sortKey="Balbiani, Philippe" sort="Balbiani, Philippe" uniqKey="Balbiani P" first="Philippe" last="Balbiani">Philippe Balbiani</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>Institut de recherche en informatique de Toulouse, CNRS — Université de Toulouse</wicri:regionArea><wicri:noRegion>CNRS — Université de Toulouse</wicri:noRegion><wicri:noRegion>CNRS — Université de Toulouse</wicri:noRegion></affiliation></author><author><name sortKey="Van Ditmarsch, Hans" sort="Van Ditmarsch, Hans" uniqKey="Van Ditmarsch H" first="Hans" last="Van Ditmarsch">Hans Van Ditmarsch</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>LORIA, CNRS - Université de Lorraine</wicri:regionArea><placeName><settlement type="city">Nancy</settlement><settlement type="city">Metz</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université de Lorraine</orgName></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Inde</country><wicri:regionArea>IMSc, Chennai</wicri:regionArea><wicri:noRegion>Chennai</wicri:noRegion></affiliation></author><author><name sortKey="Kudinov, Andrey" sort="Kudinov, Andrey" uniqKey="Kudinov A" first="Andrey" last="Kudinov">Andrey Kudinov</name><affiliation wicri:level="3"><country xml:lang="fr">Russie</country><wicri:regionArea>Institute for Information Transmission Problems RAS & Higher School of Economics, Moscow</wicri:regionArea><placeName><settlement type="city">Moscou</settlement><region>District fédéral central</region></placeName></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Russie</country><wicri:regionArea>Moscow Institute of Physics and Technology</wicri:regionArea></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this paper we introduce public announcements to Subset Space Logic (SSL). In order to do this we have to change the original semantics for SSL a little and consider a weaker version of SSL without the cross axiom. We present an axiomatization, prove completeness and show that this logic is PSPACE-complete. Finally, we add the arbitrary announcement modality which expresses “true after any announcement”, prove several semantic results, and show completeness for a Hilbert-style axiomatization of this logic.</div></front></TEI><affiliations><list><country><li>France</li><li>Inde</li><li>Russie</li></country><region><li>District fédéral central</li><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Metz</li><li>Moscou</li><li>Nancy</li></settlement><orgName><li>Université de Lorraine</li></orgName></list><tree><country name="France"><noRegion><name sortKey="Balbiani, Philippe" sort="Balbiani, Philippe" uniqKey="Balbiani P" first="Philippe" last="Balbiani">Philippe Balbiani</name></noRegion><name sortKey="Van Ditmarsch, Hans" sort="Van Ditmarsch, Hans" uniqKey="Van Ditmarsch H" first="Hans" last="Van Ditmarsch">Hans Van Ditmarsch</name></country><country name="Inde"><noRegion><name sortKey="Van Ditmarsch, Hans" sort="Van Ditmarsch, Hans" uniqKey="Van Ditmarsch H" first="Hans" last="Van Ditmarsch">Hans Van Ditmarsch</name></noRegion></country><country name="Russie"><region name="District fédéral central"><name sortKey="Kudinov, Andrey" sort="Kudinov, Andrey" uniqKey="Kudinov A" first="Andrey" last="Kudinov">Andrey Kudinov</name></region><name sortKey="Kudinov, Andrey" sort="Kudinov, Andrey" uniqKey="Kudinov A" first="Andrey" last="Kudinov">Andrey Kudinov</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001480 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001480 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:43CB7EDD46EE62E35797219287474695DF82BE3E
|texte= Subset Space Logic with Arbitrary Announcements
}}
| This area was generated with Dilib version V0.6.33. |  |